Doubly Biased Maker-Breaker Connectivity Game
نویسندگان
چکیده
In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b.
منابع مشابه
Random-Player Maker-Breaker games
In a (1 : b) Maker-Breaker game, one of the central questions is to find the maximal value of b that allows Maker to win the game (that is, the critical bias b∗). Erdős conjectured that the critical bias for many Maker-Breaker games played on the edge set of Kn is the same as if both players claim edges randomly. Indeed, in many Maker-Breaker games, “Erdős Paradigm” turned out to be true. There...
متن کامل1 9 N ov 2 01 4 The Disjoint Domination Game ∗
We introduce and study a Maker-Breaker type game in which the issue is to create or avoid two disjoint dominating sets in graphs without isolated vertices. We prove that the maker has a winning strategy on all connected graphs if the game is started by the breaker. This implies the same in the (2 : 1) biased game also in the maker-start game. It remains open to characterize the maker-win graphs...
متن کاملAsymptotic random graph intuition for the biased connectivity game
We study biased Maker/Breaker games on the edges of the complete graph, as introduced by Chvátal and Erdős. We show that Maker, occupying one edge in each of his turns, can build a spanning tree, even if Breaker occupies b ≤ (1 − o(1)) · n lnn edges in each turn. This improves a result of Beck, and is asymptotically best possible as witnessed by the Breaker-strategy of Chvátal and Erdős. We als...
متن کاملBiased Weak Polyform Achievement Games
In a biased weak (a, b) polyform achievement game, the maker and the breaker alternately mark a, b previously unmarked cells on an infinite board, respectively. The maker’s goal is to mark a set of cells congruent to a polyform. The breaker tries to prevent the maker from achieving this goal. A winning maker strategy for the (a, b) game can be built from winning strategies for games involving f...
متن کاملContinuous Box game
The classical positional game Box was introduced by Chvátal and Erdős in 1978 in their study of the biased connectivity game on the complete graph. Their analysis was subsequently extended by Hamidoune and Las Vergnas. The board of the Box game consists of elements of n disjoint sets (boxes), which might vary in size. The game is played by two players, Maker and Breaker. Maker claims m board el...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012